/
Your selections:
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning
The many facets of upper domination
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th.
Algorithmic aspects of upper domination: a parameterised perspective
On the complexity landscape of the domination chain
Upper domination: complexity and approximation
A novel parameterised approximation algorithm for minimum vertex cover
- Brankovic, Ljiljana, Fernau, Henning
Parameterized approximation algorithms for HITTING SET
Breaking the 2ⁿ-barrier for irredundance: two lines of attack
- Binkele-Raible, Daniel, Brankovic, Ljiljana, Wojtaszczyk, Jakub Onufry, Cygan, Marek, Fernau, Henning, Kneis, Joachim, Kratsch, Dieter, Langer, Alexander, Liedloff, Mathieu, Pilipczuk, Marcin, Rossmanith, Peter
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance
- Binkele-Raible, Daniel, Brankovic, Ljiljana, Fernau, Henning, Kneis, Joachim, Kratsch, Dieter, Langer, Alexander, Liedloff, Mathieu, Rossmanith, Peter
Combining two worlds: parameterised approximation for vertex cover
Parameterized algorithmics for d-HITTING SET
- Fernau, Henning
Facility location problems: a parameterized view
- Fellows, Michael, Fernau, Henning
A refined search tree technique for Dominating Set on planar graphs
- Alber, Jochen, Fan, Hongbing, Fellows, Michael R., Fernau, Henning, Niedermeier, Rolf, Rosamond, Fran, Stege, Ulrike
Approximability of a {0,1} - matrix problem
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
- Chen, J. N., Fernau, Henning, Kanj, I. A., Xia, G.
Two-layer planarization: Improving on parameterized algorithmics
Are you sure you would like to clear your session, including search history and login status?